Search Results

Documents authored by Lieutier, André

Document
DOI: 10.4230/LIPIcs.SoCG.2022.8
Delaunay-Like Triangulation of Smooth Orientable Submanifolds by 𝓁₁-Norm Minimization

Authors: Dominique Attali and André Lieutier

Published in: LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022)

Abstract
In this paper, we focus on one particular instance of the shape reconstruction problem, in which the shape we wish to reconstruct is an orientable smooth submanifold of the Euclidean space. Assuming we have as input a simplicial complex K that approximates the submanifold (such as the Čech complex or the Rips complex), we recast the reconstruction problem as a 𝓁₁-norm minimization problem in which the optimization variable is a chain of K. Providing that K satisfies certain reasonable conditions, we prove that the considered minimization problem has a unique solution which triangulates the submanifold and coincides with the flat Delaunay complex introduced and studied in a companion paper [D. Attali and A. Lieutier, 2022]. Since the objective is a weighted 𝓁₁-norm and the contraints are linear, the triangulation process can thus be implemented by linear programming.
Cite as

Dominique Attali and André Lieutier. Delaunay-Like Triangulation of Smooth Orientable Submanifolds by 𝓁₁-Norm Minimization. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 8:1-8:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)

Copy BibTex To Clipboard

@InProceedings{attali_et_al:LIPIcs.SoCG.2022.8,
  author =	{Attali, Dominique and Lieutier, Andr\'{e}},
  title =	{{Delaunay-Like Triangulation of Smooth Orientable Submanifolds by 𝓁₁-Norm Minimization}},
  booktitle =	{38th International Symposium on Computational Geometry (SoCG 2022)},
  pages =	{8:1--8:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-227-3},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{224},
  editor =	{Goaoc, Xavier and Kerber, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.8},
  URN =		{urn:nbn:de:0030-drops-160162},
  doi =		{10.4230/LIPIcs.SoCG.2022.8},
  annote =	{Keywords: manifold reconstruction, Delaunay complex, triangulation, sampling conditions, optimization, 𝓁₁-norm minimization, simplicial complex, chain, fundamental class}
}
Document
DOI: 10.4230/LIPIcs.SoCG.2020.32
Lexicographic Optimal Homologous Chains and Applications to Point Cloud Triangulations

Authors: David Cohen-Steiner, André Lieutier, and Julien Vuillamy

Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)

Abstract
This paper considers a particular case of the Optimal Homologous Chain Problem (OHCP) for integer modulo 2 coefficients, where optimality is meant as a minimal lexicographic order on chains induced by a total order on simplices. The matrix reduction algorithm used for persistent homology is used to derive polynomial algorithms solving this problem instance, whereas OHCP is NP-hard in the general case. The complexity is further improved to a quasilinear algorithm by leveraging a dual graph minimum cut formulation when the simplicial complex is a pseudomanifold. We then show how this particular instance of the problem is relevant, by providing an application in the context of point cloud triangulation.
Cite as

David Cohen-Steiner, André Lieutier, and Julien Vuillamy. Lexicographic Optimal Homologous Chains and Applications to Point Cloud Triangulations. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 32:1-32:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{cohensteiner_et_al:LIPIcs.SoCG.2020.32,
  author =	{Cohen-Steiner, David and Lieutier, Andr\'{e} and Vuillamy, Julien},
  title =	{{Lexicographic Optimal Homologous Chains and Applications to Point Cloud Triangulations}},
  booktitle =	{36th International Symposium on Computational Geometry (SoCG 2020)},
  pages =	{32:1--32:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-143-6},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{164},
  editor =	{Cabello, Sergio and Chen, Danny Z.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.32},
  URN =		{urn:nbn:de:0030-drops-121908},
  doi =		{10.4230/LIPIcs.SoCG.2020.32},
  annote =	{Keywords: OHCP, simplicial homology, triangulation, Delaunay}
}
Document
DOI: 10.4230/LIPIcs.SoCG.2019.11
When Convexity Helps Collapsing Complexes

Authors: Dominique Attali, André Lieutier, and David Salinas

Published in: LIPIcs, Volume 129, 35th International Symposium on Computational Geometry (SoCG 2019)

Abstract
This paper illustrates how convexity hypotheses help collapsing simplicial complexes. We first consider a collection of compact convex sets and show that the nerve of the collection is collapsible whenever the union of sets in the collection is convex. We apply this result to prove that the Delaunay complex of a finite point set is collapsible. We then consider a convex domain defined as the convex hull of a finite point set. We show that if the point set samples sufficiently densely the domain, then both the Cech complex and the Rips complex of the point set are collapsible for a well-chosen scale parameter. A key ingredient in our proofs consists in building a filtration by sweeping space with a growing sphere whose center has been fixed and studying events occurring through the filtration. Since the filtration mimics the sublevel sets of a Morse function with a single critical point, we anticipate this work to lay the foundations for a non-smooth, discrete Morse Theory.
Cite as

Dominique Attali, André Lieutier, and David Salinas. When Convexity Helps Collapsing Complexes. In 35th International Symposium on Computational Geometry (SoCG 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 129, pp. 11:1-11:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@InProceedings{attali_et_al:LIPIcs.SoCG.2019.11,
  author =	{Attali, Dominique and Lieutier, Andr\'{e} and Salinas, David},
  title =	{{When Convexity Helps Collapsing Complexes}},
  booktitle =	{35th International Symposium on Computational Geometry (SoCG 2019)},
  pages =	{11:1--11:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-104-7},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{129},
  editor =	{Barequet, Gill and Wang, Yusu},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.11},
  URN =		{urn:nbn:de:0030-drops-104152},
  doi =		{10.4230/LIPIcs.SoCG.2019.11},
  annote =	{Keywords: collapsibility, convexity, collection of compact convex sets, nerve, filtration, Delaunay complex, Cech complex, Rips complex}
}
Document
DOI: 10.4230/LIPIcs.SoCG.2018.10
The Reach, Metric Distortion, Geodesic Convexity and the Variation of Tangent Spaces

Authors: Jean-Daniel Boissonnat, André Lieutier, and Mathijs Wintraecken

Published in: LIPIcs, Volume 99, 34th International Symposium on Computational Geometry (SoCG 2018)

Abstract
In this paper we discuss three results. The first two concern general sets of positive reach: We first characterize the reach by means of a bound on the metric distortion between the distance in the ambient Euclidean space and the set of positive reach. Secondly, we prove that the intersection of a ball with radius less than the reach with the set is geodesically convex, meaning that the shortest path between any two points in the intersection lies itself in the intersection. For our third result we focus on manifolds with positive reach and give a bound on the angle between tangent spaces at two different points in terms of the distance between the points and the reach.
Cite as

Jean-Daniel Boissonnat, André Lieutier, and Mathijs Wintraecken. The Reach, Metric Distortion, Geodesic Convexity and the Variation of Tangent Spaces. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 10:1-10:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{boissonnat_et_al:LIPIcs.SoCG.2018.10,
  author =	{Boissonnat, Jean-Daniel and Lieutier, Andr\'{e} and Wintraecken, Mathijs},
  title =	{{The Reach, Metric Distortion, Geodesic Convexity and the Variation of Tangent Spaces}},
  booktitle =	{34th International Symposium on Computational Geometry (SoCG 2018)},
  pages =	{10:1--10:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-066-8},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{99},
  editor =	{Speckmann, Bettina and T\'{o}th, Csaba D.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.10},
  URN =		{urn:nbn:de:0030-drops-87236},
  doi =		{10.4230/LIPIcs.SoCG.2018.10},
  annote =	{Keywords: Reach, Metric distortion, Manifolds, Convexity}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact